Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Sketching of Big Data

Author : M. Parameswari 1

Date of Publication :29th March 2018

Abstract: The Human beings create everything but the most innovative and creative one is the internet. The internet has allowed for very less transfer of data and information in a fraction of seconds. The next level of the internet with human innovation to increase the communication, data speed and a large amount of data gathering. The solution for a large amount of data gathering is big data. Big data is the very large amount of data it does not possible to fit in single machine main memory. The need for big data analysis in increased day by day. In this paper analysis and evaluate the sketching and streaming of big data algorithms. The advantages of sketching include less memory consumption, faster algorithms, and reduced bandwidth requirements in distributed computing environments. Now a day’s sketching of big data is an essential one

Reference :

    1. Noga Alon, Yossi Matias, Mario Szegedy. The Space Complexity of Approximating the Fre-quency Moments. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 20{29, 1996.
    2.  Kasper Larsen, Jelani Nelson. Optimality of the Johnson-Lindenstrauss Lemma. Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2017.
    3.  [CT65] James W. Cooley and John W. Tukey. An algorithm for the machine calculation of complex fourier series. Math. Comp., 19(90):297{301, 4 1965.
    4. [DL42] Gordon C. Danielson and Cornelius Lanczos. Some improvements in practical fourier analysis and their application to x-ray scattering from liquids. J. Franklin Inst., 233(4):365{ 380, 4 1942.
    5. [Mor78] Robert Morris. Counting large numbers of events in small registers. Commun. ACM, 21(10):840{842, 10 1978.8
    6.  [AC09] Nir Ailon and Bernard Chazelle. The fast Johnson{Lindenstrauss transform and ap- proximate nearest neighbors. SIAM J. Comput., 39(1):302{322, 2009.
    7. [BDF+11] Jean Bourgain, Stephen Dilworth, Kevin Ford, Sergei Konyagin, and Denka Kutzarova. Explicit constructions of RIP matrices and related problems. Duke Mathematical Jour- nal, 159(1):145{185, 2011.

Recent Article